Using Typed Interfaces to Compose CHR Programs
نویسندگان
چکیده
? 1 Introduction
منابع مشابه
Type Inference in CHR Programs for the Composition of Constraint Systems
The deenition of Constraint Handling Rules in (constraint)-logic programming systems is a glass-box-approach to extend these systems with new constraint symbols. Thus syntax and semantics for constraint logic programs are provided by the underlying system and the constraint handler given by a (single) extension. To deene CHR programs as a composition of reusable components, the syntactic proper...
متن کاملCPL: A Core Language for Cloud Computing - Technical Report
Running distributed applications in the cloud involves deployment. That is, distribution and configuration of application services and middleware infrastructure. The considerable complexity of these tasks resulted in the emergence of declarative JSON-based domain-specific deployment languages to develop deployment programs. However, existing deployment programs unsafely compose artifacts writte...
متن کاملA Type System for CHR
We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension of a host language, such as Prolog or Java, this type system is parameterized by the type system of the host language. We show the consistency of the type system for CHR w.r.t. its operational semantics. We also study the case ...
متن کاملOn Confluence of Non-terminating CHR Programs
Confluence is an important property for any kind of rewrite system including CHR, which is a general-purpose declarative committedchoice language consisting of multi-headed guarded rules. CHR can yield a confluence problem, because of non-determinism in the choice of rules using the abstract semantics. Confluence in CHR is an ongoing research topic, because it provides numerous benefits for imp...
متن کاملImplementing and Analysing Union-Find in CHR
CHR is a committed-choice rule-based language that was originally intended for writing constraint solvers. In this paper we show that it is also possible to write the classic union-find algorithm and variants in CHR. The programs neither compromise in declarativeness nor efficiency. Using CHR analysis techniques we study logical correctness, confluence and time complexity of our programs. We ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000